Conjunctive Query Answering for the Description Logic SHOIQ
نویسندگان
چکیده
The Semantic Web [2] aims at making web resources more accessible to automated processes by augmenting web pages with descriptions of their content. Ontologies are used to provide precisely specified meanings for these descriptions, and with the Web Ontology Language OWL [1] a standardised ontology building language is available. A notable feature of OWL is that two of the three OWL species (OWL Lite and OWL DL) correspond to Description Logics ∗This work was supported by an EPSRC studentship.
منابع مشابه
Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ
The high computational complexity of the expressive Description Logics (DLs) that underlie the OWL standard has motivated the study of their Horn fragments, which are usually tractable in data complexity and can also have lower combined complexity, particularly for query answering. In this paper we provide algorithms for answering conjunctive 2-way regular path queries (2CRPQs), a nontrivial ge...
متن کاملData Complexity of Query Answering in Expressive Description Logics with Nominals
The formal foundations of the standard web ontology languages, OWL-Lite and OWLDL, are provided by expressive Description Logics (DLs), such as SHIF and SHOIQ. In the Semantic Web and other domains, ontologies are increasingly seen also as a mechanism to access and query data repositories. This novel context poses an original combination of challenges that has not been addressed before: (i) suf...
متن کاملThe Curse of Finiteness: Undecidability of Database-Inspired Reasoning Problems in Very Expressive Description Logics
Recently, the field of knowledge representation is drawing a lot of inspiration from database theory. In particular, in the area of description logics and ontology languages, interest has shifted from satisfiability checking to query answering, with various query notions adopted from databases, like (unions of) conjunctive queries or different kinds of path queries. Likewise, the finite model s...
متن کاملUndecidability Results for Database-Inspired Reasoning Problems in Very Expressive Description Logics
Recently, the field of knowledge representation is drawing a lot of inspiration from database theory. In particular, in the area of description logics and ontology languages, interest has shifted from satisfiability checking to query answering, with various query notions adopted from databases, like (unions of) conjunctive queries or different kinds of path queries. Likewise, the finite model s...
متن کاملUnions of Conjunctive Queries in SHOQ
Conjunctive queries play an important role as an expressive query language in Description Logics (DLs). Decision procedures for expressive Description Logics are, however, only recently emerging and it is still an open question whether answering conjunctive queries is decidable for the DL SHOIQ that underlies the OWL DL standard. In fact, no decision procedure was known for expressive DLs that ...
متن کامل